Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees
نویسندگان
چکیده
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k trees and k connected partial k trees these include subgraph isomorphism and topological embedding known to be NP complete for general partial k trees As well as contributing to our understanding of the types of graphs for which these problems are tractable this paper introduces new methods for solving problems on graphs In particular we make use of a tree like representation of the graph the tree decomposition of the graph to apply techniques used to solve problems on trees to solve problems on more general classes of graphs
منابع مشابه
Parallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملEdge-Coloring Partial k-Trees
Ž Many combinatorial problems can be efficiently solved for partial k-trees graphs . of treewidth bounded by k . The edge-coloring problem is one of the well-known combinatorial problems for which no efficient algorithms were previously known, except a polynomial-time algorithm of very high complexity. This paper gives a linear-time sequential algorithm and an optimal parallel algorithm which f...
متن کاملMinimum Spanning Trees for Minor-Closed Graph Classes in Parallel
For each minor-closed graph class we show that a simple variant of Borůvka’s algorithm computes a MST for any input graph belonging to that class with linear costs. Among minor-closed graph classes are e.g planar graphs, graphs of bounded genus, partial k-trees for fixed k, and linkless or knotless embedable graphs. The algorithm can be implemented on a CRCW PRAM to run in logarithmic time with...
متن کاملLinear time algorithms for NP-hard problems restricted to partial k-trees
We present and illustrate by a sequence of examples an algorithm paradigm for solving NPhard problems on graphs restricted to partial graphs of k-trees and given with an embedding in a k-tree. Such algorithms, linear in the size of the graph but exponential or superexponential in k, exist for most NP-hard problems that have liiear time algorithms for trees. The examples used are optimization pr...
متن کاملD - Width , Metric Embedding , and Their Connections
Embedding between metric spaces is a very powerful algorithmic tool and has been used for finding good approximation algorithms for several problems. In particular, embedding to an l1 norm has been used as the key step in an approximation algorithm for the sparsest cut problem. The sparsest cut problem, in turn, is the main ingredient of many algorithms that have a divide and conquer nature and...
متن کامل